An Isabelle/HOL Formalization of the SCL(FOL) Calculus
نویسندگان
چکیده
Abstract We present an Isabelle/HOL formalization of Simple Clause Learning for first-order logic without equality: SCL(FOL). The main results are formal proofs soundness, non-redundancy learned clauses, termination, and refutational completeness. Compared to the unformalized version, formalized calculus is simpler more general, some such as stronger non-subsumption new. found one bug in a previously published version SCL Backtrack rule. related formalizations, we introduce new technique showing termination based on non-redundant clause learning.
منابع مشابه
Formalization of Refinement Calculus for Reactive Systems
We present a formalization of refinement calculus for reactive systems. Refinement calculus is based on monotonic predicate transformers (monotonic functions from sets of post-states to sets of pre-states), and it is a powerful formalism for reasoning about imperative programs. We model reactive systems as monotonic property transformers that transform sets of output infinite sequences into set...
متن کاملOn the Formalization of the Modal µ-Calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the formalization of modal (sequent-style) rules and of context sensitive grammars. The formalization c...
متن کاملFormalization of the Integral Calculus in the PVS Theorem Prover
The PVS theorem prover is a widely used formal verification tool used for the analysis of safetycritical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and computer science that is used in a verificatio...
متن کاملFormalization of SLD-Resolution in the calculus of inductive constructions
This report presents a full formalization of the operational semantics of deenite programs (used in logic programming), given by SLD-Resolution. The variables renaming process used during a SLD-derivation is completely deened in an explicit manner. Furthermore, constructive proofs of two well known lemmas (lifting lemma and switching lemma) are built from this formalization in the calculus of i...
متن کاملA Constructive Formalization of the Fundamental Theorem of Calculus
We have finished a constructive formalization in the theorem prover Coq of the Fundamental Theorem of Calculus, which states that differentiation and integration are inverse processes. In this formalization, we have closely followed Bishop’s work ([4]). In this paper, we describe the formalization in some detail, focusing on how some of Bishop’s original proofs had to be refined, adapted or red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-38499-8_7